A capacitated lot-sizing model with sequence-dependent setups, parallel machines and bi-part injection moulding
نویسندگان
چکیده
This paper aims to propose a model for solving capacitated lot-sizing problem with sequence-dependent setups (CLSD) and parallel machines in bi-part injection moulding (BPIM) context that consists of injecting two different parts or products into the same mould separate cavities. These require sequence order available capacity at instant, but generate part inventories. The addressed should be considered multi-machine CLSD-BPIM one. We provide mixed integer linear programming (MILP) it. proposed is based on real-world case study from second-tier supplier automotive sector. In setup, inventory resource setup costs terms, benefits are validated by comparing it single-machine replicates current planning scenario carried out company under study. Additionally, random instances real have been generated tested. computational results exhibit optimal solutions small an average 0.2-second solution time, medium present gaps 0.47% 2.6 h large 4% 6 time.
منابع مشابه
An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups
This paper presents a novel mathematical programming approach to the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and setup costs. The approach is partly based on the earlier work of Haase and Kimms [2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of ...
متن کاملFinite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups
This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....
متن کاملCapacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period — in other words, at least one sub tour exists in the production sequence of that ...
متن کاملLTO Heuristics for Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes
The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.
متن کاملRelax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2021
ISSN: ['1872-8480', '0307-904X']
DOI: https://doi.org/10.1016/j.apm.2021.07.028